Eulerian digraph
英
美
网络 欧拉有向图
双语例句
- The algorithm is also suitable to an Eulerian digraph.
此文所给出的算法同样适用于有向欧拉图。 - Algorithms searching for a directed Euler tour in a Eulerian digraph and the shortest Euler trial in a non-Eulerian digraph are also developed.
除此，还给出了在非有向欧拉图中找一条最短欧拉道路的算法。